Sensitivity bond graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sensitivity Bond Graphs

A sensitivity bond graph, of the same structure as the system bond graph, is shown to provide a simple and effective method of generating sensitivity functions of use in optimisation. The approach is illustrated in the context of partially-known system parameter and state estimation.

متن کامل

Bond Graphs

The topic area that has become commonly known as ‘bond graph modeling and simulation’ should be separated into at the one hand the port-based approach to modeling and simulation and at the other hand the bond graph notation that is well suited to represent the port-concept. For this reason both the notation and the concepts directly related to the notation will be separated as much as possible ...

متن کامل

Bond Graphs III: Bond Graphs and Electrical Networks

Electrical networks are defined and a definition of when a bond graph and an electrical network are equivalent is given. Bond graphs and electrical networks are defined to be primitive if they contain no transformers or gyrators. A bond graph is defined to be realisable if it is equivalent to an electrical network and primitively realisable if it is equivalent to a primitive electrical network....

متن کامل

Bicausal Bond Graphs

P.J. Gawthrop Centre for Systems and Control, University of Glasgow. [email protected] Key Words| Bond graphs; causality; system inversion; parameter estimation Abstract|Conventional bond graph theory is predicated on the notion that a bond has a single causal stroke: an effort imposed at one end implies a ow imposedat the other. This notion is implied by components having a known consti...

متن کامل

Bond Percolation on Isoradial Graphs

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Franklin Institute

سال: 2000

ISSN: 0016-0032

DOI: 10.1016/s0016-0032(00)00052-1